A New Approach to Indexing in High-Dimensional Space
نویسندگان
چکیده
SVI is a promising new scheme for indexing high-dimensional points and vectors for use in vector retrieval and for nding the k-nearest neighbours. SVI performs an approximate search; that is, it trades oo the completeness of the search for speed. The indexing scheme is built around a rule that was found by applying data mining techniques to sets of random vectors. This approach could well lead to further improvements in the indexing scheme.
منابع مشابه
یک روش مبتنی بر خوشهبندی سلسلهمراتبی تقسیمکننده جهت شاخصگذاری اطلاعات تصویری
It is conventional to use multi-dimensional indexing structures to accelerate search operations in content-based image retrieval systems. Many efforts have been done in order to develop multi-dimensional indexing structures so far. In most practical applications of image retrieval, high-dimensional feature vectors are required, but current multi-dimensional indexing structures lose their effici...
متن کاملEfficient Similarity Indexing and Searching in High Dimensions
Efficient indexing and searching of high dimensional data has been an area of active research due to the growing exploitation of high dimensional data and the vulnerability of traditional search methods to the " curse of dimensionality ". This paper presents a new approach for fast and effective searching and indexing of high dimensional features using random partitions of the feature space. Ex...
متن کاملISIS: A New Approach for Efficient Similarity Search in Sparse Databases
High-dimensional sparse data is prevalent in many real-life applications. In this paper, we propose a novel index structure for accelerating similarity search in high-dimensional sparse databases, named ISIS, which stands for Indexing Sparse databases using Inverted fileS. ISIS clusters a dataset and converts the original high-dimensional space into a new space where each dimension represents a...
متن کاملAbstract: Packing rectangular shapes into a rectangular space is one of the most important discussions on Cutting & Packing problems (C;P) such as: cutting problem, bin-packing problem and distributor's pallet loading problem, etc. Assume a set of rectangular pieces with specific lengths, widths and utility values. Also assume a rectangular packing space with specific width and length. The obj...
متن کاملAn efficient high-dimensional indexing method for content-based retrieval in large image databases
High-dimensional indexing methods have been proved quite useful for response time improvement. Based on Euclidian distance, many of them have been proposed for applications where data vectors are high-dimensional. However, these methods do not generally support efficiently similarity search when dealing with heterogeneous data vectors. In this paper, we propose a high-dimensional indexing metho...
متن کامل